Dynamic Constraint Aggregation for Solving Very Large-scale Airline Crew Pairing Problems
نویسندگان
چکیده
منابع مشابه
Solving Large Scale Crew Pairing Problems
Crew pairing is one of the most critical processes in airline management operations. Taking a timetable as input, the objective of this process is to find an optimal way to partition flights of the timetable without breaking rules and regulations which are enforced by an airline. The problem has attracted many scientists in recent decades. The main challenge is that there is no general method t...
متن کاملSolving Large Airline Crew Scheduling Problems: Random Pairing Generation and Strong Branching
The airline crew scheduling problem is the problem of assigning crew itineraries to flights. We develop a new approach for solving the problem that is based on enumerating hundreds of millions random pairings. The linear programming relaxation is solved first and then millions of columns with best reduced cost are selected for the integer program. The number of columns is further reduced by a l...
متن کاملMultiobjective Optimization Genetic Algorithms for Domestic Airline Crew Pairing Problems
Airline crew pairing problems involve assigning the required crew members to each flight segment in a given time period, while complying with a variety of work regulations and collective agreements. Traditional researches formulate the pairing problems as integer programming problems, and use deterministic approaches to optimize the solutions. Such these approaches usually suffer from some crit...
متن کاملSolving a robust airline crew pairing problem with column generation
In this study, we solve a robust version of the airline crew pairing problem. Our concept of robustness was partially shaped during our discussions with small local airlines in Turkey which may have to add a set of extra flights into their schedule at short notice during operation. Thus, robustness in this case is related to the ability of accommodating these extra flights at the time of operat...
متن کاملA Hybrid Approach for Solving Large Scale Crew Scheduling Problems
We consider several strategies for computing optimal solutions to large scale crew scheduling problems. Provably optimal solutions for very large real instances of such problems were computed using a hybrid approach that integrates mathematical and constraint programming techniques. The declarative nature of the latter proved instrumental when modeling complex problem restrictions and, particul...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SN Operations Research Forum
سال: 2020
ISSN: 2662-2556
DOI: 10.1007/s43069-020-00016-1